Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem

Program trace optimization with constructive heuristics for combinatorial problems

This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.EvoCOP: 19th European Conference on Evolutionary Computation in Combinatorial Optimisation, 24-26 April 2019, Leipzig, GermanyProgram Trace Optimisation (PTO), a highly general optimisation framework, is applied to a range of combinatorial optimisation (COP) problems. It effectively combines \smart" problem-specifi c constructive heuristics and problem-agnostic metaheuristic search, automatically and implicitly designing problem-appropriate search operators. A weakness is identifi ed in PTO's operators when applied in conjunction with smart heuristics on COP problems, and an improved method is introduced to address this. To facilitate the comparison of this new method with the original, across problems, a common format for PTO heuristics (known as generators) is demonstrated, mimicking GRASP. This also facilitates comparison of the degree of greediness (the GRASP alpha parameter) in the heuristics. Experiments across problems show that the novel operators consistently outperform the original without any loss of generality or cost in CPU time; hill-climbing is a sufficient metaheuristic; and intermediate levels of greediness are usually best

A Fast Algorithm for Robust Regression with Penalised Trimmed Squares

The presence of groups containing high leverage outliers makes linear regression a difficult problem due to the masking effect. The available high breakdown estimators based on Least Trimmed Squares often do not succeed in detecting masked high leverage outliers in finite samples. An alternative to the LTS estimator, called Penalised Trimmed Squares (PTS) estimator, was introduced by the authors in \cite{ZiouAv:05,ZiAvPi:07} and it appears to be less sensitive to the masking problem. This estimator is defined by a Quadratic Mixed Integer Programming (QMIP) problem, where in the objective function a penalty cost for each observation is included which serves as an upper bound on the residual error for any feasible regression line. Since the PTS does not require presetting the number of outliers to delete from the data set, it has better efficiency with respect to other estimators. However, due to the high computational complexity of the resulting QMIP problem, exact solutions for moderately large regression problems is infeasible. In this paper we further establish the theoretical properties of the PTS estimator, such as high breakdown and efficiency, and propose an approximate algorithm called Fast-PTS to compute the PTS estimator for large data sets efficiently. Extensive computational experiments on sets of benchmark instances with varying degrees of outlier contamination, indicate that the proposed algorithm performs well in identifying groups of high leverage outliers in reasonable computational time.Comment: 27 page

Intratumoral IL-12 delivery empowers CAR-T cell immunotherapy in a pre-clinical model of glioblastoma

Glioblastoma multiforme (GBM) is the most common and aggressive form of primary brain cancer, for which effective therapies are urgently needed. Chimeric antigen receptor (CAR)-based immunotherapy represents a promising therapeutic approach, but it is often impeded by highly immunosuppressive tumor microenvironments (TME). Here, in an immunocompetent, orthotopic GBM mouse model, we show that CAR-T cells targeting tumor-specific epidermal growth factor receptor variant III (EGFRvIII) alone fail to control fully established tumors but, when combined with a single, locally delivered dose of IL-12, achieve durable anti-tumor responses. IL-12 not only boosts cytotoxicity of CAR-T cells, but also reshapes the TME, driving increased infiltration of proinflammatory CD4+ T cells, decreased numbers of regulatory T cells (Treg), and activation of the myeloid compartment. Importantly, the immunotherapy-enabling benefits of IL-12 are achieved with minimal systemic effects. Our findings thus show that local delivery of IL-12 may be an effective adjuvant for CAR-T cell therapy for GBM

Mosaic evolution in an asymmetrically feathered troodontid dinosaur with transitional features

Asymmetrical feathers have been associated with flight capability but are also found in species that do not fly, and their appearance was a major event in feather evolution. Among non-avialan theropods, they are only known in microraptorine dromaeosaurids. Here we report a new troodontid, Jianianhualong tengi gen. et sp. nov., from the Lower Cretaceous Jehol Group of China, that has anatomical features that are transitional between long-armed basal troodontids and derived short-armed ones, shedding new light on troodontid character evolution. It indicates that troodontid feathering is similar to Archaeopteryx in having large arm and leg feathers as well as frond-like tail feathering, confirming that these feathering characteristics were widely present among basal paravians. Most significantly, the taxon has the earliest known asymmetrical troodontid feathers, suggesting that feather asymmetry was ancestral to Paraves. This taxon also displays a mosaic distribution of characters like Sinusonasus, another troodontid with transitional anatomical features.published_or_final_versio

An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports

This paper puts forward an integrated optimisation model that combines three distinct problems, namely berth allocation, quay crane assignment, and quay crane scheduling that arise in container ports. Each one of these problems is difficult to solve in its own right. However, solving them individually leads almost surely to sub-optimal solutions. Hence, it is desirable to solve them in a combined form. The model is of the mixed-integer programming type with the objective being to minimize the tardiness of vessels and reduce the cost of berthing. Experimental results show that relatively small instances of the proposed model can be solved exactly using CPLEX. Large scale instances, however, can only be solved in reasonable times using heuristics. Here, an implementation of the genetic algorithm is considered. The effectiveness of this implementation is tested against CPLEX on small to medium size instances of the combined model. Larger size instances were also solved with the genetic algorithm, showing that this approach is capable of finding the optimal or near optimal solutions in realistic times